Watermarking Three-Dimensional Polygonal Models

نویسندگان

  • Ryutarou Ohbuchi
  • Hiroshi Masuda
  • Masaki Aono
چکیده

The advantages of digital media such as the Internet and CD-ROMs lie in the fact that their contents are easy to duplicate, edit, and distribute. These advantages, however, are double-edged swords, because they also facilitate unauthorized use of such contents. Data embedding, which places information into the contents themselves, is an approach to address this issue. Embedded information can be used, for example, for copyright protection, theft deterrence, and inventory. This paper discusses our work on embedding data into three-dimensional (3D) polygonal models of geometry. Given objects consisting of points, lines, polygons, or curved surfaces, the data embedding algorithms described in this paper produce polygonal models with data embedded. Data are placed into 3D polygonal models by modifying either their vertex coordinates, their vertex topology (connectivity), or both. A brief review of related work and a description of the requirements of data embedding is followed by a discussion of where, and by what fundamental methods, data can be embedded into 3D polygonal models. The paper then presents data-embedding algorithms, with examples, based on these fundamental methods. Additional

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fragile Watermarking of Three-Dimensional Objects

There has recently been many work on watermarking of 2D images and video. However, watermarking of threedimensional (3D) objects has received little attentions. In this paper, we introduce and investigate the watermarking of three-dimensional (3D) objects as compared to 2D images, study the watermarking of objects represented by polygonal models, and, propose a new fragile watermarking techniqu...

متن کامل

Watermarking three-dimensional polygonal models through geometric and topological modifications

This paper discusses techniques for embedding data into three-dimensional (3D) polygonal models of geometry. Given objects consisting of points, lines, (connected) polygons, or curved surfaces, the algorithms described in this paper produce polygonal models with data embedded into either their vertex coordinates, their vertex topology (connectivity), or both. Such data embedding can be used, fo...

متن کامل

New Spectral Decomposition for 3D Polygonal Meshes and its Application for Watermarking

This paper present a generalization of a data analysis technique called a singular spectrum analysis (SSA). The original SSA is a tool for analyzing one-dimensional data such as time series, whereas our generalization is suitable for multi-dimensional data such as 3D polygonal meshes. One of applications of the proposed generalization are also shown. The application of the generalized SSA is a ...

متن کامل

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Generalized SSA and Its Applications to Watermarking 3D Polygonal Meshes

This paper presents a generalization of the singular spectrum analysis (SSA) and applies it to the construction of a new robust watermarking method that adds a watermark to a 3D polygonal mesh in the spectral domain. The SSA is originally designed as a tool for analyzing one-dimensional sequence such as time series, and hence it is not suitable for multi-dimensional data. In order to overcome t...

متن کامل

Watermarking for 3d Polygons Using Wavelet Transform and Modified Traveling Salesman Problem

Recent developments in computer technologies and networks have enabled the use of high-quality digital contents, such as electronic documents, images, and audio and video contents. A watermarking technique has recently been developed for the copyright protection of these digital contents. There are few watermarking techniques for three-dimensional (3D) geometric models, such as solid models or ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997